On the Success Probability of Decoding (Partial) Unit Memory Codes
نویسندگان
چکیده
In this paper, we derive analytic expressions for the success probability of decoding (Partial) Unit Memory codes in memoryless channels. An applications of this result is that these codes outperform individual block codes in certain channels.
منابع مشابه
On (Partial) Unit Memory Codes Based on Gabidulin Codes
Partial) Unit Memory ((P)UM) codes provide a powerful possibility to construct convolutional codes based on block codes in order to achieve a high decoding performance. In this contribution, a construction based on Gabidulin codes is considered. This construction requires a modified rank metric, the so–called sum rank metric. For the sum rank metric, the free rank distance, the extended row ran...
متن کاملOn Multi-Point Local Decoding of Reed-Muller Codes
Reed-Muller codes are among the most important classes of locally correctable codes. Currently local decoding of Reed-Muller codes is based on decoding on lines or quadratic curves to recover one single coordinate. To recover multiple coordinates simultaneously, the naive way is to repeat the local decoding for recovery of a single coordinate. This decoding algorithm might be more expensive, i....
متن کاملImproving success probability and embedding efficiency in code based steganography
For stegoschemes arising from error correcting codes, embedding depends on a decoding map for the corresponding code. As decoding maps are usually not complete, embedding can fail. We propose a method to ensure or increase the probability of embedding success for these stegoschemes. This method is based on puncturing codes. We show how the use of punctured codes may also increase the embedding ...
متن کاملPerformance Analysis of Linear Block Codes Over the Queue-Based Channel
Most coding schemes used in today’s communication systems are designed for memoryless channels. These codes break down when they are transmitted over channels with memory, which is in fact what real-world channels look like since errors often occur in bursts. Therefore, these systems employ interleaving to spread the errors so that the channel looks more or less memoryless (for the decoder) at ...
متن کاملTowards an optimal parallel decoding of turbo codes
High throughput decoding of turbo-codes can be achieved thanks to parallel decoding. However, for finite block sizes, the initialisation duration of each half-iteration reduces the activity of the processing units, especially for higher degrees of parallelism. To solve this issue, a new decoding scheduling is proposed, with a partial processing overlapping of two successive half iterations. Pot...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1705.08652 شماره
صفحات -
تاریخ انتشار 2017